Johan van Benthem Cognition
نویسنده
چکیده
Many cognitive activities are irreducibly social, involving interaction between several different agents. We look at some examples of this in linguistic communication and games, and show how logical methods provide exact models for the relevant information flow and world change. Finally, we discuss possible connections in this arena between logico-computational approaches and experimental cognitive science.
منابع مشابه
Johan van Benthem on Logic and Information Dynamics
Introducing a new hobby for other people may inspire them to join with you. Reading, as one of mutual hobby, is considered as the very easy hobby to do. But, many people are not interested in this hobby. Why? Boring is the reason of why. However, this feel actually can deal with the book and time of you reading. Yeah, one that we will refer to break the boredom in reading is choosing johan van ...
متن کاملCognition as Interaction
Many cognitive activities are irreducibly social, involving interaction between several different agents. We look at some examples of this in linguistic communication and games, and show how logical methods provide exact models for the relevant information flow and world change. Finally, we discuss possible connections in this arena between logico-computational approaches and experimental cogni...
متن کاملFanning the Flames of Reason Valedictory Lecture a Personal View of Logic Fanning the Flames
On 26 September 2014, Johan van Benthem, Professor of Pure and Applied Logic, delivered his valedictory lecture in the auditoriumof theUniversity of Amsterdam. Modern logic is the broad, exact science of information directed behaviour that plays an important role in connecting the humanities, exact sciences and social sciences at the university, and which forms the bedrock of our information so...
متن کاملLogic and Complexity in Cognitive Science
This chapter surveys the use of logic and computational complexity theory in cognitive science. We emphasize in particular the role played by logic in bridging the gaps between Marr’s three levels: representation theorems for non-monotonic logics resolve algorithmic/implementation debates, while complexity theory probes the relationship between computational task analysis and algorithms. We arg...
متن کاملJohan van Benthem Modal Frame Correspondences and Fixed - Points Dedicated to the memory of
Taking Löb’s Axiom in modal provability logic as a running thread, we discuss some general methods for extending modal frame correspondences, mainly by adding fixed-point operators to modal languages as well as their correspondence languages. Our suggestions are backed up by some new results — while we also refer to relevant work by earlier authors. But our main aim is advertizing the perspecti...
متن کامل